A new algorithm for finding vertex-disjoint paths

The fact that the demands which could be labelled as “luxurious” in the past times, have became requirements makes it inevitable that the service providers do new researches and prepare alternative plans under harsh competition conditions. In order to provide the customers with the services in terms of the committed standards by taking the possible damages on wired and wireless networks into consideration. Finding vertex disjoint paths gives many advantages on the wired or wireless communication especially on Ad-Hoc Networks. In this paper, we suggest a new algorithm that calculates alternative routes which do not contain common vertex (vertex-disjoint path) with problematic route during a point-to-point communication on the network in a short time and it is compared to similar algorithms.